Termination of Simply
نویسندگان
چکیده
منابع مشابه
Simple Termination is Di cult
A terminating term rewriting system is called simply terminating if its termination can be shown by means of a simpliication ordering, an ordering with the property that a term is always bigger than its proper subterms. Almost all methods for proving termination yield, when applicable, simple termination. We show that simple termination is an undecidable property, even for one-rule systems. Thi...
متن کاملSimple Termination Is Diicult
A terminating term rewriting system is called simply terminating if its termination can be shown by means of a simpliication ordering, an ordering with the property that a term is always bigger than its proper subterms. Almost all methods for proving termination yield, when applicable, simple termination. We show that simple termination is an undecidable property, even for one-rule systems. Thi...
متن کاملA Termination Proof of Reduction in a Simply Typed Calculus with Constructors
The well-known proof of termination of reduction in simply typed calculi is adapted to a monomorphically typed lambda-calculus with case and constructors and recursive data types. The proof differs at several places from the standard proof. Perhaps it is useful and can be extended also to more complex calculi
متن کاملSimple Termination of Rewrite Systems
In this paper we investigate the concept of simple termination. A term rewriting system (TRS for short) is called simply terminating if its termination can be proved by means of a simplification order. We propose a new definition of simplification order and we investigate the properties of the resulting class of simply terminating systems.
متن کاملHigher-Order Path Orders Based on Computability
Simply-typed term rewriting systems (STRSs) are an extension of term rewriting systems. STRSs can be naturally handle higher order functions, which are widely used in existing functional programming languages. In this paper we design recursive and lexicographic path orders, which can efficiently prove the termination of STRSs. Moreover we discuss an application to the dependency pair and the ar...
متن کاملTermination by Absence of Infinite Chains of Dependency Pairs
A technique to prove termination of term rewrite systems, or more precise, constructorsystems (CSs) is presented.Soundnessof this technique is proved and it is described how the technique can be performed automatically for a subclass of the CSs. Whereas simplification orders fail in proving termination of CSs that are not simply terminating, the presented technique may still automatically prove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008